Static scheduling for dynamic dataflow machines
نویسندگان
چکیده
منابع مشابه
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools are limited in their ability to effectively handle dynamic application behavior. In this paper, we develop efficient quasi-static scheduling techniques for a broad class of dynamically-reconfigurable dataflow specific...
متن کاملSelf-timed Periodic Scheduling for a Cyclo-static DataFlow Model
Real-time and time-constrained applications programmed on many-core systems can suffer from unmet timing constraints even with correct-by-construction schedules. Such unexpected results are usually caused by unaccounted for delays due to resource sharing (e.g. the communication medium). In this paper we address the three main sources of unpredictable behaviors: First, we propose to use a determ...
متن کاملStatic Scheduling and Code Generation from Dynamic Dataflow Graphs With Integer - Valued Control Streams
This paper extends the token flow model of Buck and Lee ([1],[2]), an analytical model for the behavior of dataflow graphs with data-dependent control flow, in two ways: dataflow actor execution may depend on integer, rather than Boolean, control tokens, and multiphase implementations of actors are permitted. These extensions permit data-dependent iteration to be modelled more naturally, reduce...
متن کاملHierarchical static scheduling of dataflow graphs onto multiple processors
In this paper we discuss a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering technique that reduces the number of actors before expanding the SDF graph into an directed acyclic graph (DAG). The internals of the clusters are then scheduled with uniprocessor SDF schedulers...
متن کاملDynamic Scheduling on Parallel Machines
We study the problem of online job-scheduling on parallel machines with di erent network topologies. An online scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. We give an O(plog logN)-competitive algorithm for online scheduling on a two-dimensional mesh of N processors and we prove a matching lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1990
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90030-s